全文获取类型
收费全文 | 37631篇 |
免费 | 3025篇 |
国内免费 | 2290篇 |
专业分类
化学 | 17310篇 |
晶体学 | 159篇 |
力学 | 1245篇 |
综合类 | 767篇 |
数学 | 12994篇 |
物理学 | 10471篇 |
出版年
2023年 | 257篇 |
2022年 | 419篇 |
2021年 | 1311篇 |
2020年 | 776篇 |
2019年 | 927篇 |
2018年 | 693篇 |
2017年 | 781篇 |
2016年 | 1006篇 |
2015年 | 1001篇 |
2014年 | 1389篇 |
2013年 | 2499篇 |
2012年 | 1651篇 |
2011年 | 1827篇 |
2010年 | 1716篇 |
2009年 | 2200篇 |
2008年 | 2343篇 |
2007年 | 2546篇 |
2006年 | 2002篇 |
2005年 | 1374篇 |
2004年 | 1265篇 |
2003年 | 1283篇 |
2002年 | 1323篇 |
2001年 | 1238篇 |
2000年 | 887篇 |
1999年 | 775篇 |
1998年 | 714篇 |
1997年 | 540篇 |
1996年 | 598篇 |
1995年 | 529篇 |
1994年 | 505篇 |
1993年 | 534篇 |
1992年 | 523篇 |
1991年 | 366篇 |
1990年 | 294篇 |
1989年 | 241篇 |
1988年 | 262篇 |
1987年 | 235篇 |
1986年 | 240篇 |
1985年 | 354篇 |
1984年 | 279篇 |
1983年 | 156篇 |
1982年 | 318篇 |
1981年 | 482篇 |
1980年 | 443篇 |
1979年 | 486篇 |
1978年 | 376篇 |
1977年 | 290篇 |
1976年 | 248篇 |
1974年 | 80篇 |
1973年 | 154篇 |
排序方式: 共有10000条查询结果,搜索用时 46 毫秒
81.
82.
Marién Abreu Jan Goedgebeur Domenico Labbate Giuseppe Mazzuoccolo 《Journal of Graph Theory》2019,92(4):415-444
A -bisection of a bridgeless cubic graph is a -colouring of its vertex set such that the colour classes have the same cardinality and all connected components in the two subgraphs induced by the colour classes ( monochromatic components in what follows) have order at most . Ban and Linial Conjectured that every bridgeless cubic graph admits a -bisection except for the Petersen graph. A similar problem for the edge set of cubic graphs has been studied: Wormald conjectured that every cubic graph with has a -edge colouring such that the two monochromatic subgraphs are isomorphic linear forests (ie, a forest whose components are paths). Finally, Ando conjectured that every cubic graph admits a bisection such that the two induced monochromatic subgraphs are isomorphic. In this paper, we provide evidence of a strong relation of the conjectures of Ban-Linial and Wormald with Ando's Conjecture. Furthermore, we also give computational and theoretical evidence in their support. As a result, we pose some open problems stronger than the above-mentioned conjectures. Moreover, we prove Ban-Linial's Conjecture for cubic-cycle permutation graphs. As a by-product of studying -edge colourings of cubic graphs having linear forests as monochromatic components, we also give a negative answer to a problem posed by Jackson and Wormald about certain decompositions of cubic graphs into linear forests. 相似文献
83.
84.
Let K and S be locally compact Hausdorff spaces and let X be a strictly convex Banach space of finite dimension at least 2. In this paper, we prove that if there exists an isomorphism T from onto satisfying then K and S are homeomorphic. Here denotes the Schäffer constant of X. Even for the classical cases , and , this result is the X‐valued Banach–Stone theorem via isomorphism with the largest distortion that is known so far, namely . On the other hand, it is well known that this result is not true for , even though K and S are compact Hausdorff spaces. 相似文献
85.
Pham Duy Khanh Tran Hong Mo Trinh T. T. Tran 《Numerical Functional Analysis & Optimization》2019,40(8):924-943
Necessary and sufficient conditions for qualitative properties of infinite dimensional linear programing problems such as solvability, duality, and complementary slackness conditions are studied in this article. As illustrations for the results, we investigate the parametric version of Gale’s example. 相似文献
86.
Yasuhito Tanaka 《Operations Research Letters》2019,47(5):406-409
We study a dynamic free-entry oligopoly with sluggish entry and exit of firms under general demand and cost functions. We show that the number of firms in a steady-state open-loop solution for a dynamic free-entry oligopoly is smaller than that at static equilibrium and that the number of firms in a steady-state memoryless closed-loop solution is larger than that in an open-loop solution. 相似文献
87.
Stevo Stevi Bratislav Iri
anin Witold Kosmala Zdenk marda 《Mathematical Methods in the Applied Sciences》2019,42(5):1687-1701
Some formulas for well‐defined solutions to four very special cases of a nonlinear fifth‐order difference equation have been presented recently in this journal, where some of them were proved by the method of induction, some are only quoted, and no any theory behind the formulas was given. Here, we show in an elegant constructive way how the general solution to the difference equation can be obtained, from which the special cases very easily follow, which is also demonstrated here. We also give some comments on the local stability results on the special cases of the nonlinear fifth‐order difference equation previously publish in this journal. 相似文献
88.
This paper develops a framework to deal with the unconditional superclose analysis of
nonlinear parabolic equation. Taking the finite element pair $Q_{11}/Q_{01} × Q_{10}$ as an example,
a new mixed finite element method (FEM) is established and the $τ$ -independent superclose
results of the original variable $u$ in $H^1$-norm and the flux variable $\mathop{q} \limits ^{\rightarrow}= −a(u)∇u$ in $L^2$-norm are deduced ($τ$ is the temporal partition parameter). A key to our analysis is an
error splitting technique, with which the time-discrete and the spatial-discrete systems are
constructed, respectively. For the first system, the boundedness of the temporal errors is obtained. For the second system, the spatial superclose results are presented unconditionally, while the previous literature always only obtain the convergent estimates or require
certain time step conditions. Finally, some numerical results are provided to confirm the
theoretical analysis, and show the efficiency of the proposed method. 相似文献
89.
90.
Michael Braun 《组合设计杂志》2019,27(11):682-687
An ‐arc in is a set of points such that each line contains at most of the selected points. It is well known that ‐arcs in correspond to projective linear codes. Let denote the maximal number of points for which an ‐arc in exists. In this paper we obtain improved lower bounds on by explicitly constructing ‐arcs. Some of the constructed ‐arcs correspond to linear codes meeting the Griesmer bound. All results are obtained by integer linear programming. 相似文献